Maintaining Reeb Graphs of Triangulated 2-Manifolds
نویسندگان
چکیده
Let M be a triangulated, orientable 2-manifold of genus g without boundary, and let h be a height function over M that is linear within each triangle. We present a kinetic data structure (KDS) for maintaining the Reeb graph R of h as the heights of M’s vertices vary continuously with time. Assuming the heights of two vertices of M become equal only O(1) times, the KDS processes O((κ + g)n polylogn) events; n is the number of vertices in M, and κ is the number of external events which change the combinatorial structure of R. Each event is processed in O(log2 n) time, and the total size of our KDS is O(gn). The KDS can be extended to maintain an augmented
منابع مشابه
Stability of Reeb graphs under function perturbations: the case of closed curves
Reeb graphs provide a method for studying the shape of a manifold by encoding the evolution and arrangement of level sets of a simple Morse function defined on the manifold. Since their introduction in computer graphics they have been gaining popularity as an effective tool for shape analysis and matching. In this context one question deserving attention is whether Reeb graphs are robust agains...
متن کاملReeb Graphs of Curves Are Stable under Function Perturbations
Reeb graphs provide a method to combinatorially describe the shape of a manifold endowed with a Morse function. One question deserving attention is whether Reeb graphs are robust against function perturbations. Focusing on 1-dimensional manifolds, we define an editing distance between Reeb graphs of curves, in terms of the cost necessary to transform one graph into another through editing moves...
متن کاملLayered Reeb graphs for three-dimensional manifolds in boundary representation
Reeb graphs are topological graphs originating in Morse theory, which represent the topological structure of a manifold by contracting the level set components of a scalar-valued function defined on it. The generalization to several functions leads to Reeb spaces, which are thus able to capture more features of an object. We introduce the layered Reeb graph as a discrete representation for Reeb...
متن کاملEfficient algorithms for computing Reeb graphs
The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(n log n+n log...
متن کاملEfficient Output-Sensitive Construction of Reeb Graphs
The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these cri...
متن کامل